Minimum cost K-forest coversBAAS, S. M; ORESTES CERDEIRA, J.Mathematical methods of operations research (Heidelberg). 1996, Vol 44, Num 2, pp 255-265, issn 1432-2994Article

Matroids and a forest cover problemORESTES CERDEIRA, J.Mathematical programming. 1994, Vol 66, Num 3, pp 403-405, issn 0025-5610Article

k-Connectivity and decomposition of graph into forestsNISHIZEKI, T; POLJAK, S.Discrete applied mathematics. 1994, Vol 55, Num 3, pp 295-301, issn 0166-218XArticle

Studies on hypergraphs. I: hyperforestsZHANG, L.Discrete applied mathematics. 1993, Vol 42, Num 1, pp 95-112, issn 0166-218XArticle

Fractals arithmétiques = Arithmetic fractalsLong, Lun-Hai; Reveillès, Jean-Pierre.1993, 113 p.Thesis

An enumerating function for spanning forests with color restrictionsBAPAT, R. B; CONSTANTINE, G.Linear algebra and its applications. 1992, Vol 173, pp 231-237, issn 0024-3795Article

Sur les distributions du nombre de sommets dans les couches d'une forêt aléatoirePAVLOV, YU. L.Teoriâ verojatnostej i eë primeneniâ. 1988, Vol 33, Num 1, pp 105-114, issn 0040-361XArticle

Morphological segmentation produces a Voronoï tesselation of the markersMEYER, Fernand.International Conference on Image Processing. 2004, isbn 0-7803-8554-3, 5Vol, Vol5, 3077-3080Conference Paper

Multicolored forests in bipartite decompositions of graphsALON, N; BRUALDI, R. A; SHADER, B. L et al.Journal of combinatorial theory. Series B. 1991, Vol 53, Num 1, pp 143-148, issn 0095-8956Article

How to build argumental graphs using TAG shared forest : A view from control verbs problematicSEDDAH, Djamé; GAIFFE, Bertrand.Lecture notes in computer science. 2005, pp 287-300, issn 0302-9743, isbn 3-540-25783-7, 14 p.Conference Paper

The number of maximal independent sets in triangle-free graphsHUJTER, M; TUZA, Z.SIAM journal on discrete mathematics (Print). 1993, Vol 6, Num 2, pp 284-288, issn 0895-4801Article

A new bijection on rooted forestsERDOS, P. L.Discrete mathematics. 1993, Vol 111, Num 1-3, pp 179-188, issn 0012-365XConference Paper

A polyhedral intersection theorem for capacitated spanning treesHALL, L. A; MAGNANTI, T. L.Mathematics of operations research. 1992, Vol 17, Num 2, pp 398-410, issn 0364-765XArticle

A ternary search problem on graphsANDREAE, T.Discrete applied mathematics. 1989, Vol 23, Num 1, pp 1-10, issn 0166-218XArticle

Sur une classe de transformations d'arbres = On a class of tree-transformationsBOZAPALIDIS, S.Informatique théorique et applications (Imprimé). 1988, Vol 22, Num 1, pp 43-47, issn 0988-3754Article

The Johnson-Lindenstrauss lemma and the sphericity of some graphsFRANKL, P; MAEHARA, H.Journal of combinatorial theory. Series B. 1988, Vol 44, Num 3, pp 355-362, issn 0095-8956Article

Linear arboricity for graphs with multiple edgesHOURIA AIT-DJAFER.Journal of graph theory. 1987, Vol 11, Num 2, pp 135-140, issn 0364-9024Article

Combinatoire énumérative de plusieurs structures finies = Enumerative combinatorics of several finite structuresHOCINI, Fadila; KREWERAS, Germain.1986, 48 pThesis

Generalized local colorings of graphsTRUSZCZYNSKI, M.Journal of combinatorial theory. Series B. 1992, Vol 54, Num 2, pp 178-188, issn 0095-8956Article

On isomorphic subgraphsGOULD, R. J; RÖDL, V.Discrete mathematics. 1993, Vol 118, Num 1-3, pp 259-262, issn 0012-365XArticle

On the higher-order edge toughness of a graphCHEN, C. C; KOH, K. M; PENG, Y. H et al.Discrete mathematics. 1993, Vol 111, Num 1-3, pp 113-123, issn 0012-365XConference Paper

Mahonian statistics on labeled forestsLIANG, K; WACHS, M. L.Discrete mathematics. 1992, Vol 99, Num 1-3, pp 181-197, issn 0012-365XArticle

Some results on linear arboricityGULDAN, F.Journal of graph theory. 1986, Vol 10, Num 4, pp 505-509, issn 0364-9024Article

Finding a noncrossing Steiner forest in plane graphs under a 2-face conditionKUSAKARI, Yoshiyuki; MASUBUCHI, Daisuke; NISHIZEKI, Takao et al.Journal of combinatorial optimization. 2001, Vol 5, Num 2, pp 249-266, issn 1382-6905Article

Page / 9